GENIUS-CP: a Generic Single-Vehicle Routing Algorithm

This paper describes the combination of a well-known tsp heuristic, genius, with a constraint programming model for routing problems. The result, genius-cp, is an eecient heuristic single-vehicle routing algorithm which is generic in the sense that it can solve problems from many diierent contexts, each with its particular type(s) of constraints. The heuristic quickly constructs high-quality solutions while the constraint model provides great exibility as to the nature of the problem constraints involved by relieving that heuristic of all constraint satisfaction concerns. We show how those two components are integrated in a clean way with a well-deened, minimal interface. We also describe diierent routing problems on which this algorithm can be applied and evaluate its performance.